Explicit Negation in Relational

نویسندگان

  • Rajshekhar Sunderraman
  • Rajiv Bagai
چکیده

Negative facts in relational databases have traditionally been inferred using the closed world assumption. There are situations where this is not appropriate. We need to resort to the open world assumption, where the negative facts are sometimes explicitly stated. We present a formalism which is capable of answering queries in the relational database context under the open world assumption. We introduce partial relations, which are extensions of relations. We deene the information content of partial relations as the set of all possible ordinary relations that are represented by a partial relation. We then deene algebraic operators over partial relations. The correctness of the algebraic operations on partial relations is established with respect to their information content. Finally, we present an application of the extended relational model, in which we show how the formalism introduced in this paper can be used to compute the semantics of general deductive databases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generalized Disjunctive Paraconsistent Data Model for Negative and Disjunctive Information

This paper presents a generalization of the disjunctive paraconsistent relational data model in which disjunctive positive and negative information can be represented explicitly and manipulated. There are situations where the closed world assumption to infer negative facts is not valid or undesirable and there is a need to represent and reason with negation explicitly. We consider explicit disj...

متن کامل

The Expressive Power of SPARQL

This paper studies the expressive power of SPARQL. The main result is that SPARQL and non-recursive safe Datalog with negation have equivalent expressive power, and hence, by classical results, SPARQL is equivalent from an expressive point of view to Relational Algebra. We present explicit generic rules of the transformations in both directions. Among other findings of the paper are the proof t...

متن کامل

Inconsistency and Incompleteness in Relational Databases and Logic Programs

The aim of this thesis is to study the role played by negation in databases and to develop data models that can handle inconsistent and incomplete information. We develop models that also allow incompleteness through disjunctive information under both the CWA and the OWA in relational databases. In the area of logic programming, extended logic programs allow explicit representation of negative ...

متن کامل

0 DLV – A System for Declarative Problem Solving ∗

DLV is an efficient logic programming and nonmonotonic reasoning (LPNMR) system with advanced knowledge representation mechanisms and interfaces to classic relational database systems. Its core language is disjunctive datalog (function-free disjunctive logic programming) under the Answer Set Semantics with integrity constraints, both default and strong (or explicit) negation, and queries. Integ...

متن کامل

DLV - A System for Declarative Problem Solving

DLV is an efficient logic programming and nonmonotonic reasoning (LPNMR) system with advanced knowledge representation mechanisms and interfaces to classic relational database systems. Its core language is disjunctive datalog (function-free disjunctive logic programming) under the Answer Set Semantics with integrity constraints, both default and strong (or explicit) negation, and queries. Integ...

متن کامل

Minimal Negation in the Ternary Relational Semantics

Minimal Negation is defined within the basic positive relevance logic in the relational ternary semantics: B+. Principles of weak negation are shown to be isolable, thus defining a number of subminimal negations in the B+ context. Complete ternary semantics are offered for minimal negation in B+. Certain forms of reductio are conjectured to be undefinable (in ternary frames) without extending t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007